package com.example.algorithm.no0004;

import com.example.algorithm.no0004.solution.SolutionImpl;

import java.util.Arrays;

/**
 * @Description 解答测试-寻找两个正序数组的中位数
 * @ClassName SolutionTest
 * @Author Administrator
 * @Date 2020/5/16 12:54
 * @Version 1.0.0
 */
public class SolutionTest {

    static int[] nums1 = new int[]{2, 7, 11, 15};
    static int[] nums2 = new int[]{2, 7, 11, 15};

    public static void main(String[] args) {
        System.out.println("输入数组1为: " + Arrays.toString(nums1));
        System.out.println("输入数组2为: " + Arrays.toString(nums2));

        Solution solution = new SolutionImpl();

        System.out.println(solution.findMedianSortedArrays(nums1, nums2));

    }
}
